Disentangling Two Orthogonal Matrices
نویسندگان
چکیده
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal Procrustes problem. We propose an algorithm based on a semi-definite programming (SDP) relaxation, and give a theoretical guarantee for its performance. Both theoretically and empirically, the proposed algorithm performs better than the näıve approach of solving the linear system directly without the orthogonal constraints.
منابع مشابه
Disentangling orthogonal matrices.
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal Procrustes problem. We propose an algorithm based on a semi-definite programming (SDP) relaxation, and give a theoretical guarantee for its performance. Both theore...
متن کاملOn the optimal correction of inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint
This work focuses on the correction of both the coecient and the right hand side matrices of the inconsistent matrix equations $AX = B$ and $XC = D$ with orthogonal constraint. By optimal correction approach, a general representation of the orthogonal solution is obtained. This method is tested on two examples to show that the optimal correction is eective and highly accurate.
متن کاملJ-Orthogonal Matrices: Properties and Generation
A real, square matrix Q is J-orthogonal if Q JQ = J , where the signature matrix J = diag(±1). J-orthogonal matrices arise in the analysis and numerical solution of various matrix problems involving indefinite inner products, including, in particular, the downdating of Cholesky factorizations. We present techniques and tools useful in the analysis, application and construction of these matrices...
متن کاملDisentangling Quantum States while Preserving All Local Properties
We consider here a disentanglement process which transforms a state r of two subsystems into an unentangled (i.e., separable) state, while not affecting the reduced density matrix of either subsystem. Recently, Terno [Phys. Rev. A 59, 3320 (1999)] showed that an arbitrary state cannot be disentangled, by a physically allowable process, into a tensor product of its reduced density matrices. In t...
متن کاملOn the Construction of Quasi-Binary and Quasi-Orthogonal Matrices over Finite Fields
Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using orthogonal matrices come from the fact that the computation of inverse matrices is avoided, by simply using the transpose of the orthogonal matrix. In this pa...
متن کامل